Merge Path Improvements for Minimal Model Hyper Tableaux

Minimal Model Generation Based on E-hyper Tableaux

Minimal model generation has received great attention as people have deeper and deeper understanding in the semantics of the logic programming, deductive database, non monotonic reasoning and the relationships among them. But most proposed minimal model generation procedures in the literature are inappropriate in the sense that while generating minimal model, they also generate non-minimal mode...

Institut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Positive Unit Hyper-resolution Tableaux for Minimal Model Generation Positive Unit Hyper-resolution Tableaux for Minimal Model Generation

Minimal Herbrand models for clausal theories are useful in several areas of computer science, e.g. automated theorem proving, program veriication, logic programming, databases, and artiicial intelligence. In most cases, the conventional model generation algorithms are inappropriate because they generate nonminimal Herbrand models and can be ineecient. This article describes a novel approach for...

Institut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Minimal Model Generation with Positive Unit Hyper-resolution Tableaux Minimal Model Generation with Positive Unit Hyper-resolution Tableaux

Herbrand models for clausal theories are useful in several areas of computer science. In most cases, however, the conventional model generation algorithms are inappropriate because they generate non-minimal Herbrand models and can be ineecient. This article describes a novel approach for generating minimal Herbrand models of clausal theories. The approach builds upon positive unit hyper-resolut...

Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux

Theorem Proving Techniques for View Deletion in Databases

In this paper, we show how techniques from first-order theorem proving can be used for efficient deductive database updates. The key idea is to transform the given database, together with the update request, into a (disjunctive) logic program and to apply the hyper-tableau calculus (Baumgartner et al., 1996) to solve the original update problem. The resulting algorithm has the following propert...